Reduced Base Model Construction Methods for Stochastic Activity Networks

نویسندگان

  • William H. Sanders
  • John F. Meyer
چکیده

Computer-aided modeling has become an accepted technique for predicting the performance and dependability of computer-communication networks. Many model formalisms have been proposed for this purpose, and have achieved varying degrees of success. One particular model type, stochastic Petri nets, has received considerable attention during the last ten years. Several classes of models of this type now exist and, as evidenced by their use in speci c evaluation studies, they are capable of representing the kind of complex behavior exhibited by computer-communication networks. However, a number of problems remain open, particularly those associated with the evaluation of large-scale systems. Speci cally, the issue here is the size and complexity of the stochastic process, derived from the underlying net model, which serves as a \base model" for subsequent solution of the measures in question. If this base model constructed by standard means, e.g., it is identi ed with the marking behavior of the net, traditional methods of solution quickly become intractable for large systems, limiting their application to systems of only moderate complexity. This problem is addressed in the context of a particular class of stochastic Petri nets, stochastic activity networks (SANs), by developing base model construction methods that account for symmetries in SAN structure and are tailored to the variable (e.g., response time, time to failure, etc.) in question. We nd that such a technique can yield dramatic reductions in state-space size while preserving stochastic properties required for practical means of solution. Moreover, unlike state aggregation methods that rely on explicit knowledge the more detailed state space, this technique permits direct construction of a reduced base model, thus avoiding size limitations associated with more traditional approaches to model simpli cation. The presentation includes both the theory required to establish the technique's validity and an illustration of its e ectiveness in the evaluation of a CSMA/CD computer network. This work was supported in part by the Digital Equipment Corporation Faculty Program: Incentives for Excellence and by the O ce of Naval Research under Contract No. N00014-85-K-0531.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DESIGN AND IMPLEMENTATION OF A REDUCED BASE MODEL CONSTRUCTION TECHNIQUE FOR STOCHASTIC ACTIVITY NETWORKS by

Performance/dependability evaluation via modeling results in fast and economic system development. Traditionally, simulations have been used to evaluate realistic systems but do not yield exact results. Analytic solution methods can yield exact results, but can su er from the state-space explosion problem. A reduced base model construction technique for stochastic activity networks, which explo...

متن کامل

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

A Stochastic Model for Water Resources Management

Irrigation water management is crucial for agricultural production and livelihood security in many regions and countries throughout the world. Over the past decades, controversial and conflictladen water-allocation issues among competing municipal, industrial and agricultural interests have raised increasing concerns. Particularly, growing population, varying natural conditions and shrinking wa...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

Dependability Evaluation Using Composed SAN-Based Reward Models

Dependability evaluation is an important, but di cult, aspect of the design of fault-tolerant parallel and distributed computing systems. One possible technique is to use Markov models, but if applied directly to realistic designs, this often results in large and intractable models. Many authors have investigated methods to avoid this explosive state-space growth, but have typically either solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989